package usaco.c2009.november.bronze;

import java.util.Scanner;

/*
 * p3459
 * USACO 2009 November - Bronze
 */

public class p3459 {

	static int N;
	static long[] x, y;
	static long min;
	static int mx, my;
	
	public static void main(String[] args) {
		
		Scanner scanner = new Scanner(System.in);
		N = scanner.nextInt();
		x = new long[N];
		y = new long[N];
		for (int i=0;i<N;++i) {
			x[i] = scanner.nextLong();
			y[i] = scanner.nextLong();
		}
		min = 20000000000L + 1;
		for (int i=0;i<N;++i) {
			for (int j=i+1;j<N;++j) {
				long d = dist(x[i], y[i], x[j], y[j]);
				if (min > d) {
					min = d;
					mx = i;
					my = j;
				}
			}
		}
		System.out.println((mx+1) + " " + (my+1));
//		System.out.println(min);

	}

	private static long dist(long x1, long y1, long x2, long y2) {
		return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
	}

}
